Integer de Casteljau Algorithm for Rasterizing NURBS Curves
نویسندگان
چکیده
An integer version of the well-known de Casteljau algorithm of NURBS curves is presented here. The algorithm is used to render NURBS curves of any degree on a raster device by turning on pixels that are closest to the curve. The approximation is independent of the parametrization, that is, it is independent of the weights used. The algorithm works entirely in the screen coordinate system and produces smooth rendering of curves without oversampling. Because of the integer arithmetic used, the algorithm is easily cast in hardware.
منابع مشابه
Modelling of curves and surfaces in polarand
A new class of spline curves in polar coordinates has been presented in (SS anchez-Reyes, 1992) and independently considered in (de Casteljau, 1994). These are rational trigonometric curves in Cartesian coordinates and can be represented as NURBS. From the relationship existing with the correspondent curves in Cartesian coordinates an alternative way to derive some useful tools for modelling sp...
متن کاملA de Casteljau Algorithm for Bernstein type Polynomials based on (p, q)-integers in CAGD
In this paper, a de Casteljau algorithm to compute (p, q)-Bernstein Bézier curves based on (p, q)integers is introduced. We study the nature of degree elevation and degree reduction for (p, q)-Bézier Bernstein functions. The new curves have some properties similar to q-Bézier curves. Moreover, we construct the corresponding tensor product surfaces over the rectangular domain (u, v) ∈ [0, 1]× [0...
متن کاملBernstein based arithmetic featuring de Casteljau
Bernstein based interval analysis permits to trace algebraic curves and surfaces. In this paper, we propose to use the classical de Casteljau algorithm to improve the efficiency of the Bernstein based method. The proposed tracing method gives significant results with functions of high degree. These results are illustrated and compared with other interval analysis approaches.
متن کاملOn Efficient Algorithms for Polynomial Evaluation in Cagd
For evaluating polynomial curves in computer design the usual algorithm is the de Casteljau algorithm. Although it is simple and stable, this algorithm is not efficient, in the sense that it has not linear complexity. In this paper we discuss and compare the properties of four more efficient algorithms used under some circumstances as alternative to the de Casteljau algorithm.
متن کاملA Generalization of Rational Bernstein Bézier Curves
This paper is concerned with a generalization of BernsteinBézier curves. A one parameter family of rational BernsteinBézier curves is introduced based on a de Casteljau type algorithm. A subdivision procedure is discussed , and matrix representation and degree elevation formulas are obtained. We also represent conic sections using rational q-BernsteinBézier curves.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. Graph. Forum
دوره 11 شماره
صفحات -
تاریخ انتشار 1992